Dynamic order acceptance and capacity planning on a single bottleneck resource

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning

This paper investigates dynamic order acceptance and capacity planning under limited regular and non-regular resources. Our goal is to maximize the profits of the accepted projects within a finite planning horizon. The way in which the projects are planned affects their payout time and, as a consequence, the reinvestment revenues as well as the available capacity for future arriving projects. I...

متن کامل

Dynamic Algorithms for Order Acceptance and Capacity Planning within a Multi-Project Environment

We consider the dynamic order acceptance and capacity planning problem under limited regular and non-regular resources. The goal consists of maximizing the expected profits of the accepted projects within a finite problem horizon. Capacity planning is a useful tool to support tactical decisions such as due-date quotation, price quotation and hiring non-regular capacity. The way the projects are...

متن کامل

A branch and price solution approach for order acceptance and capacity planning in make-to-order operations

Make-to-order (MTO) operations have to effectively manage their capacity to make long-term sustainable profits. This objective can be met by selectively accepting available customer orders and simultaneously planning for capacity. We model a MTO operation of a job-shop with multiple resources having regular and non-regular capacity. The MTO firm has a set of customer orders at time zero with fi...

متن کامل

Scheduling modular projects on a bottleneck resource

In this paper, we model a research-and-development project as consisting of several modules, with each module containing one or more activities. We examine how to schedule the activities of such a project in order to maximize the expected profit when the activities have a probability of failure and when an activity’s failure can cause its module and thereby the overall project to fail. A module...

متن کامل

UNIX Resource Managers: Capacity Planning and Resource Issues

The latest generation of UNIX includes facilities for automatically managing system resources such as processors, disks, and memory. Traditional UNIX time-share schedulers attempt to be fair to all users by employing a round-robin policy for allocating CPU time. Unfortunately, a loophole exists whereby the scheduler can be biased in favor of a greedy user running many short CPU-demand processes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Naval Research Logistics

سال: 2007

ISSN: 0894-069X,1520-6750

DOI: 10.1002/nav.20259